COMS 6998 - 3 : Algorithmic Game Theory

COMS E 6998 : Algorithmic Game Theory and Economics Jan 27 , 2011 Lecture 2 – Congestion Games

Last week we looked at a global network connection game, and used the potential function method to show the existence of a global potential function and a pure equilibrium for that game. This week we will broaden our focus to the generalization of this game, which is the category of the Congestion Games. These games are of interest because they model many network, routing and resource allocatio...

COMS 6998 - 3 : Algorithmic Game Theory October 6 , 2008 Lecture 5 : Iterative Combinatorial Auctions

In this lecture we examine a procedure that generalizes the English auction for a single good to a setting with multiple distinct goods. The model is the same as in the previous lecture, and the goal is also the same: to allocate the items efficiently. Recall that in the English auction, the seller starts with a low price of 0, and increases the price by some small increment at each round. As l...

Coms 6998-3: Sub-linear Algorithms in Learn- Ing and Testing

Reminder: Homework problem due on April 30 th .

Notes for COMS 6998-4 Fall 2017

6998 : Algorithmic Game Theory and Economics Mar 10 , 2011 Lecture 8 – Arrow - Debreu Exchange Market and Fisher ’ s Model

4. Each trader also has a utility function ui : R+ → R+ and wants to maximize his own utility; Suppose each good j has a price pj ≥ 0. Without loss of generality, we assume the price vector p = (p1, p2, . . . , pn) satisfies ∑n j=1 pj = 1. We give the definition of optimal bundles: Definition 2 (Optimal Bundle). Given p ∈ ∆n and bi = ei · p = ∑ j∈[n] eij · pj, then xi ∈ R+ is an optimal bundle ...